LaySeq: A New Representation for Non-Slicing Floorplans
نویسنده
چکیده
In this paper, we propose LaySeq a new representation for non-slicing floorplans and show its superior properties. Layseq uses only n[lg n] bits for a floorplan of n rectangular blocks. The solution space size of layseq is just O(n!). This is very smaller than that of all recent representations. Given a layseq it takes only linear time to construct the floorplan. Layseq is very simple and easy to implement representation. Based on this new structure a hybrid genetic algorithm for floorplanning is given. We show that layseq is efficient in handling rectilinear blocks too. Experimental results show that layseq results in smaller silicon area than earlier approaches.
منابع مشابه
VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions
We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement and area optimization of soft modules in very large scale integration floorplan design. We have overcome the serious representational problems usually associated with encoding slicing floorplans into GAs, and have obtained excellent (often optimal) results for module sets with up to 100 rectangle...
متن کاملBounds on the number of slicing, mosaic, and general floorplans
A floorplan can be defined as a rectangular dissection of the floorplan region. Simple and tight asymptotic bounds on the number of floorplans for different dissection structures help us to evaluate the size of the solution space of different floorplan representation. They are also interesting theoretically. However, only loose bounds exist in the literature. In this paper, we derive tighter as...
متن کاملA bijection between permutations and floorplans, and its applications
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic ...
متن کاملA fast algorithm for area minimization of slicing floorplans
The traditional algorithm for area minimization of slicing floorplans due to Stockmeyer has time and space complexity O(n2) in the worst case. For more than a decade, it has been considered the best possible. This paper presents a new algorithm of worst-case time and space complexity O(n logn), where n is the total number of realizations for the basic blocks, regardless whether the slicing is b...
متن کاملA Study on Hierarchical Floorplans of Order k
A floorplan is a rectangular dissection which describes the relative placement of electronic modules on the chip. It is called a mosaic floorplan if there are no empty rooms or cross junctions in the rectangular dissection. We study a subclass of mosaic floorplans called hierarchical floorplans of order k (abbreviated HFOk). A floorplan is a hierarchical floorplan of order k if it can be obtain...
متن کامل